Detecting Strongly Connected Components in Large Distributed State Spaces Sen Software Engineering Detecting Strongly Connected Components in Large Distributed State Spaces
نویسندگان
چکیده
Detecting cycles in a state space is a key task in verification algortihms like LTL/CTL model checking and, less well known, reduction modulo branching bisimulation. This paper focuses on the problem of finding cycles (strongly connected components) in very large distributed state spaces. We present a collection of state space transformations meant as building blocks for custom algorithms. We also describe two example algorithms and show that they perform well on practical case studies. 2000 Mathematics Subject Classification: 68N30; 68W15
منابع مشابه
A Typical Verification Challenge for the GRID
The task of detecting the strongly connected components of a very large graph is at the heart of many software verification procedures, such as model checking and state space minimization. In this context, the graphs represent system behaviour, i.e. all states of a system and all state transitions that are reachable from a given initial state. This so-called state space can be prohibitively lar...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملDistributed Branching Bisimulation Reduction of State Spaces
Enumerative model checking tools are limited by the size of the state space to which they can be applied. Reduction modulo branching bisimulation usually results in a much smaller state space and therefore enables model checking of much larger state spaces. We present an algorithm for reducing state spaces modulo branching bisimulation which is suitable for distributed implementation. The targe...
متن کاملModel Checking Coloured Petri Nets Exploiting Strongly Connected Components
In this paper we present a CTL-like logic which is interpreted over the state spaces of Coloured Petri Nets. The logic has been designed to express properties of both state and transition information. This is possible because the state spaces are labelled transition systems. We compare the expressiveness of our logic with CTL’s. Then, we present a model checking algorithm which for efficiency r...
متن کاملTowards Distributed Verification of Petri Nets Properties
The use of distributed or parallel processing gained interest in the recent years to fight the state space explosion problem. Many industrial systems are described with large models, and the state space being even larger, it does not fit completely into the memory of a single computer. In this approach several computers connected over a network cooperate. The state space is then partitionned am...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005